Edge-face chromatic number and edge chromatic number of simple plane graphs
نویسندگان
چکیده
Given a simple plane graph G, an edge-face k-coloring of G is a function : E(G) [ F (G) ! f1, . . . ,kg such that, for any two adjacent or incident elements a, b 2 E(G) [ F (G), (a) 61⁄4 (b). Let e(G), ef(G), and (G) denote the edge chromatic number, the edge-face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that ef(G) 1⁄4 e(G) 1⁄4 (G) for any 2-connected simple plane graph G with (G) 24. 2005 Wiley Periodicals, Inc. J Graph Theory 49: 234–256, 2005
منابع مشابه
On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملThe edge chromatic number of outer-1-planar graphs
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine the edge chromatic number of outer 1-planar graphs.
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملEdge-face chromatic number of plane graphs with high maximum degree
The edge-face chromatic number Xe / (G) of a plane graph G is the smallest number of colors assigned to the edges and faces of G so that any two adjacent or incident elements have different colors. Borodin(1994) proved that L1( G) ~ Xe/ (G) :::; L1( G) + 1 for each plane graph G with ~(G) ~ 10 and the bounds are sharp. The main result of this paper is to give a sufficient and necessary conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2005